A two-level preconditioned Helmholtz-Jacobi-Davidson method for the Maxwell eigenvalue problem

نویسندگان

چکیده

In this paper, based on a domain decomposition method, we propose an efficient two-level preconditioned Helmholtz-Jacobi-Davidson (PHJD) method for solving the algebraic eigenvalue problem resulting from edge element approximation of Maxwell problem. order to eliminate components in orthogonal complement space eigenvalue, shall solve parallel system and Helmholtz projection together fine space. After one coarse correction each iteration minimizing Rayleigh quotient small dimensional Davidson space, finally get error reduction PHJD as γ = c ( H stretchy="false">) 1 − C δ<!-- δ <mml:mrow class="MJX-TeXAtom-ORD"> 2 \gamma =c(H)(1-C\frac {\delta ^{2}}{H^{2}}) , where alttext="upper C"> encoding="application/x-tex">C is constant independent mesh size alttext="h"> h encoding="application/x-tex">h diameter subdomains H"> encoding="application/x-tex">H alttext="delta"> encoding="application/x-tex">\delta overlapping among subdomains, alttext="c encoding="application/x-tex">c(H) decreasing monotonically alttext="1"> encoding="application/x-tex">1 right-arrow 0"> stretchy="false">→<!-- → <mml:mn>0 encoding="application/x-tex">H\to 0 which means greater number better convergence rate. Numerical results supporting our theory are given.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Jacobi–Davidson type method for the product eigenvalue problem

We propose a Jacobi–Davidson type technique to compute selected eigenpairs of the product eigenvalue problem Am · · ·A1x = λx, where the matrices may be large and sparse. To avoid difficulties caused by a high condition number of the product matrix, we split up the action of the product matrix and work with several search spaces. We generalize the Jacobi–Davidson correction equation, and the ha...

متن کامل

The Jacobi-Davidson Method for Eigenvalue and Generalized Eigenvalue Problems

We consider variants of Davidson's method for the iterative computation of one or more eigenvalues and their corresponding eigenvectors of an n n matrix A. The original Davidson method 3], for real normal matrices A, may be viewed as an accelerated Gauss-Jacobi method, and the success of the method seems to depend quite heavily on diagonal dominance of A 3, 4, 17]. In the hope to enlarge the sc...

متن کامل

A Jacobi-Davidson Type Method for the Two-Parameter Eigenvalue Problem

We present a new numerical method for computing selected eigenvalues and eigenvectors of the two-parameter eigenvalue problem. The method does not require good initial approximations and is able to tackle large problems that are too expensive for methods that compute all eigenvalues. The new method uses a two-sided approach and is a generalization of the Jacobi– Davidson type method for right d...

متن کامل

A Jacobi-Davidson Type Method for a Right Definite Two-Parameter Eigenvalue Problem

We present a new numerical iterative method for computing selected eigenpairs of a right definite two-parameter eigenvalue problem. The method works even without good initial approximations and is able to tackle large problems that are too expensive for existing methods. The new method is similar to the Jacobi–Davidson method for the eigenvalue problem. In each step, we first compute Ritz pairs...

متن کامل

A Jacobi-Davidson-type projection method for nonlinear eigenvalue problems

This article discusses a projection method for nonlinear eigenvalue problems. The subspace of approximants is constructed by a Jacobi–Davidson type approach, and the arising eigenproblems of small dimension are solved by safeguarded iteration. The method is applied to a rational eigenvalue problem governing the vibrations of tube bundle immersed in an inviscid compressible fluid.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 2021

ISSN: ['1088-6842', '0025-5718']

DOI: https://doi.org/10.1090/mcom/3702